An analogue genetic algorithm for solving job shop scheduling problems
نویسندگان
چکیده
منابع مشابه
Solving Job-Shop Scheduling Problems by Genetic Algorithm
Job-shop Scheduling Problem (JSP) is one of extremely hard problems because it requires very large combinatorial search space and the precedence constraint between machines. The traditional algorithm used to solve the problem is the branch-andbound method, which takes considerable computing time when the size of problem is large. W e propose a new method for solving JSP using Genetic Algorithm ...
متن کاملA Combined Algorithm for Solving Job Shop Scheduling Problems
In this paper, a combined algorithm consisting of two stages of approaches is proposed for solving a Job Shop Scheduling Problem (JSSP). The first stage of approach called Semi-active Scheduling Approach (SSA) is proposed for obtaining a local optimal solution in a short time by using the improved local search algorithm and the neighborhood search technique proposed in our earlier paper. The se...
متن کاملAn Adaptive Pursuit Genetic Algorithm for Solving Job-Shop Scheduling Problems
When a metaheuristic is used for solving Job-Shop Scheduling Problems (JSPs), ones need to select the correct movement operators and their parameters to improve the results for them. However, to make a correct setup of a problem is a hard work and it is problem-dependent. In this work, we propose the use of an Adaptive Genetic Algorithm (AGA) to automatically control the techniques contained in...
متن کاملEvolving genetic algorithm for Job Shop Scheduling problems
This paper addresses an attempt to evolve genetic algorithms by a particular genetic programming method to make it able to solve the classical Job Shop Scheduling problem (JSSP), which is a type of very well known hard combinatorial optimisation problems. The aim is to look for a better GA such that solves JSSP with preferable scores. This looking up procedure is done by evolving GA with GP. Fi...
متن کاملGenetic Algorithms for Job-Shop Scheduling Problems
The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Research
سال: 2001
ISSN: 0020-7543,1366-588X
DOI: 10.1080/00207540010023538